An ordinal indexed hierarchy of separation properties
نویسندگان
چکیده
We refine and stratify the standard separation properties to produce a descending hierarchy between T3 and T1. The interpolated properties are related to the patch properties and the Vietoris modifications of the parent space.
منابع مشابه
Continua and the Co-elementary Hierarchy of Maps
The co-elementary hierarchy is a nested ordinal-indexed sequence of classes of mappings between compacta, with each successor level being defined inductively from the previous one using the topological ultracopower construction. The lowest level is the class of continuous surjections; and the next level up, the coexistential maps, is already a much more restricted class. Co-existential maps are...
متن کاملThe Algebra of Infinite Sequences: Notations and Formalization
We propose some convenient notations for expressing complicated properties of finite and infinite, ordinal-indexed sequences. The algebra of ordinal-indexed sequences is being implemented in the proofassistant Coq, together with the algebra of ordinals represented in Cantor normal form.
متن کاملThe Enumeration Spectrum Hierarchy of α-families and Lowα Degrees
In this paper we introduce a hierarchy of families which can be derived from the integers using countable collections. This hierarchy coincides with the von Neumann hierarchy of hereditary countable sets in the ZFC-theory with urelements from N. The families from the hierarchy can be coded into countable algebraic structures preserving their algorithmic properties. We prove that there is no max...
متن کاملOperations on a Wadge-Type Hierarchy of Ordinal-Valued Functions
In this thesis we investigate – under the assumption of the Axiom of Determinacy (AD) – the structure of the hierarchy of regular norms, a Wadge-type hierarchy of ordinal-valued functions that originally arose from Moschovakis’s proof of the First Periodicity Theorem in descriptive set theory. We introduce the notion of a very strong better quasi-order that will provide a framework to treat the...
متن کاملOn Freeze LTL with Ordered Attributes
This paper is concerned with Freeze LTL, a temporal logic on data words with registers. In a (multi-attributed) data word each position carries a letter from a finite alphabet and assigns a data value to a fixed, finite set of attributes. The satisfiability problem of Freeze LTL is undecidable if more than one register is available or tuples of data values can be stored and compared arbitrarily...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007